Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models

Programming for Different Memory Consistency Models

The memory consistency model, or memory model, supported by a shared-memory multiprocessor directly affects its performance. The most commonly assumed memory model is sequential consistency (SC). While SC provides a simple model for the programmer, it imposes rigid constraints on the ordering of memory accesses and restricts the use of common hardware and compiler optimizations. To remedy the s...

Satisfiability Modulo Theory Chains with DPLL(T)

We extend the DPLL(T) framework for satisfiability modulo theories to address richer theories by means of increased flexibility in the interaction between the propositional and theory-specific solvers. We decompose a rich theory into a chain of increasingly more complex subtheories, and define a corresponding propagation strategy which favors the simpler subtheories using two mechanisms. First,...

A Survey of Satisfiability Modulo Theory

Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and decision procedures for conjunctions known as DPLL(T), and the alternative “natural domain” approaches. We also cover quantifiers, Craig interpolants, polynomial...

Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models

We present a technique for verifying that a program has no executions violating sequential consistency (SC) when run under the relaxed memory models Total Store Order (TSO) and Partial Store Order (PSO). The technique works by monitoring sequentially consistent executions of a program to detect if similar program executions could fail to be sequentially consistent under TSO or PSO. We propose n...

Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems